Directed Searching Digraphs: Monotonicity and Complexity
نویسندگان
چکیده
In this paper, we introduce and study two new search models on digraphs: the directed searching and mixed directed searching. In these two search models, both searchers and intruders must follow the edge directions when they move along edges. We prove the monotonicity of both search models, and we show that both directed and mixed directed search problems are NP-complete.
منابع مشابه
Digraph Decompositions and Monotonicity in Digraph Searching
We consider monotonicity problems for graph searching games. Variants of these games – defined by the type of moves allowed for the players – have been found to be closely connected to graph decompositions and associated width measures such as pathor tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the cops can catch a robber without ever allowin...
متن کاملDirected Path-width and Monotonicity in Digraph Searching
Directed path-width was defined by Reed, Thomas and Seymour around 1995. The author and P. Hajnal defined a cops-and-robber game on digraphs in 2000. We prove that the two notions are closely related and for any digraph D, the corresponding graph parameters differ by at most one. The result is achieved using the mixed-search technique developed by Bienstock and Seymour. A search is called monot...
متن کاملMonotone Simultaneous Embeddings of Upward Planar Digraphs
We study monotone simultaneous embeddings of upward planar digraphs, which are simultaneous embeddings where the drawing of each digraph is upward planar, and the directions of the upwardness of different graphs can differ. We first consider the special case where each digraph is a directed path. In contrast to the known result that any two directed paths admit a monotone simultaneous embedding...
متن کاملGraph complexity measures and monotonicity
The structural complexity of instances of computational problems has been an important research area in theoretical computer science in the last decades. Its success manifested itself in tree-width—a complexity measure for undirected graphs. Many practically relevant problems that are difficult in general, can be efficiently solved on graphs of bounded tree-width. For directed graphs, there are...
متن کاملGraph Searching Games and Width Measures for Directed Graphs
In cops and robber games a number of cops tries to capture a robber in a graph. A variant of these games on undirected graphs characterises tree width by the least number of cops needed to win. We consider cops and robber games on digraphs and width measures (such as DAG-width, directed tree width or D-width) corresponding to them. All of them generalise tree width and the game characterising i...
متن کامل